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 10, 2026 19:00zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 19:00035,269,83926,328,0001,007,0002,113,536expected "53685385373048481 ", got "53685391658669774 "
2May 10, 2026 19:003,28236,073,02227,242,00002,113,536
3May 10, 2026 19:003,28436,266,69426,250,0001,010,0002,113,536
4May 10, 2026 19:003,29337,484,67426,293,0001,039,0002,113,536
5May 10, 2026 19:003,29835,830,91626,337,0001,038,0002,113,536
6May 10, 2026 19:003,30037,310,01526,357,0001,035,0002,113,536
7May 10, 2026 19:003,30637,623,26526,410,0001,036,0002,113,536
8May 10, 2026 19:003,31036,862,21426,448,0001,032,0002,113,536
9May 10, 2026 19:003,31436,606,37326,490,0001,022,0002,113,536