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 2, 2026 18:30CheckHarryCheckHarryScore: 6,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 18:336,04359,939,82848,998,0001,166,0002,113,536
2Sep 2, 2026 18:336,04860,020,16149,034,0001,167,0002,113,536
3Sep 2, 2026 18:336,04960,117,93049,153,0001,060,0002,113,536
4Sep 2, 2026 18:336,05060,034,39449,157,0001,062,0002,113,536
5Sep 2, 2026 18:336,05160,024,37549,189,0001,041,0002,113,536
6Sep 2, 2026 18:336,05260,078,26949,178,0001,055,0002,113,536
7Sep 2, 2026 18:336,06160,203,17849,267,0001,042,0002,113,536
8Sep 2, 2026 18:336,06560,177,37949,301,0001,046,0002,113,536
9Sep 2, 2026 18:336,06560,105,75749,262,0001,085,0002,113,536