Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 17, 2026 23:49Aleksei ShahoikaAleksei ShahoikaScore: 12,757Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 23:5012,671116,753,16982,588,00022,586,0002,113,536
2May 17, 2026 23:5012,704116,581,79683,177,00022,271,0002,113,536
3May 17, 2026 23:5012,712117,214,74183,364,00022,152,0002,113,536
4May 17, 2026 23:5012,713116,901,28883,171,00022,348,0002,113,536
5May 17, 2026 23:5012,757116,686,45682,612,00023,272,0002,113,536
6May 17, 2026 23:5012,844117,773,57683,241,00023,369,0002,113,536
7May 17, 2026 23:5012,846116,903,17582,747,00023,877,0002,113,536
8May 17, 2026 23:5012,904117,394,80382,595,00024,510,0002,113,536
9May 17, 2026 23:5013,041118,062,45682,684,00025,557,0002,113,536