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 11, 2026 02:43Josu San MartinJosu San MartinScore: 4,109Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 02:434,06742,087,57132,665,0001,097,0002,113,536
2May 11, 2026 02:434,07641,962,37732,767,0001,067,0002,113,536
3May 11, 2026 02:434,07643,041,58032,765,0001,067,0002,113,536
4May 11, 2026 02:434,08841,593,71932,864,0001,073,0002,113,536
5May 11, 2026 02:434,10943,676,72333,010,0001,101,0002,113,536
6May 11, 2026 02:434,11641,798,41733,060,0001,109,0002,113,536
7May 11, 2026 02:434,12042,255,90833,184,0001,012,0002,113,536
8May 11, 2026 02:434,12843,803,91633,183,0001,082,0002,113,536
9May 11, 2026 02:434,16243,827,06833,469,0001,081,0002,113,536