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 listMar 16, 2026 03:42zielajzielajScore: 3,507Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 21:323,49553,498,93027,010,0002,000,0002,445,312
2Mar 16, 2026 21:323,49947,269,96227,038,0002,002,0002,519,040
3Mar 16, 2026 21:323,50356,815,49427,069,0002,005,0002,441,216
4Mar 16, 2026 03:423,50748,102,76127,101,0002,007,0002,437,120
5Mar 16, 2026 03:423,52851,226,03027,264,0002,019,0002,441,216
6Mar 16, 2026 03:423,54354,214,88728,392,0001,014,0002,437,120