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 03:14CheckHarryCheckHarryScore: 7,046Success
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 03:157,01768,208,09457,237,0001,009,0002,113,536
2Sep 6, 2026 03:157,02868,229,14057,319,0001,017,0002,113,536
3Sep 6, 2026 03:157,03668,378,70457,364,0001,035,0002,113,536
4Sep 6, 2026 03:157,03968,310,96257,423,0001,007,0002,113,536
5Sep 6, 2026 03:157,04668,396,20057,480,0001,005,0002,113,536
6Sep 6, 2026 03:157,05768,504,26657,566,0001,013,0002,113,536
7Sep 6, 2026 03:157,06168,489,94257,466,0001,141,0002,113,536
8Sep 6, 2026 03:157,07568,667,89657,713,0001,010,0002,113,536
9Sep 6, 2026 03:157,08068,758,63657,739,0001,031,0002,113,536