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 listSep 6, 2026 07:53CheckHarryCheckHarryScore: 4,677Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 07:554,67248,685,66537,777,0001,008,0002,113,536
2Sep 6, 2026 07:554,67348,688,37137,784,0001,007,0002,113,536
3Sep 6, 2026 07:554,67448,774,48137,787,0001,013,0002,113,536
4Sep 6, 2026 07:554,67648,754,18337,776,0001,039,0002,113,536
5Sep 6, 2026 07:554,67748,741,79137,812,0001,008,0002,113,536
6Sep 6, 2026 07:554,67948,650,06437,830,0001,007,0002,113,536
7Sep 6, 2026 07:554,68048,723,31437,835,0001,010,0002,113,536
8Sep 6, 2026 07:554,68148,798,56737,799,0001,055,0002,113,536
9Sep 6, 2026 07:554,84050,115,52839,158,0001,014,0002,113,536