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 3, 2026 06:25CheckHarryCheckHarryScore: 4,782Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 06:254,71348,946,95838,093,0001,026,0002,113,536
2Sep 3, 2026 06:254,71849,026,99237,159,0002,002,0002,113,536
3Sep 3, 2026 06:254,73049,222,99137,260,0002,007,0002,113,536
4Sep 3, 2026 06:254,73749,184,77137,272,0002,047,0002,113,536
5Sep 3, 2026 06:254,78249,565,98837,659,0002,038,0002,113,536
6Sep 3, 2026 06:254,79149,605,11237,681,0002,087,0002,113,536
7Sep 3, 2026 06:254,91150,591,46938,748,0002,021,0002,113,536
8Sep 3, 2026 06:254,93152,177,46138,927,0002,002,0002,113,536
9Sep 3, 2026 06:254,94051,072,57939,008,0002,001,0002,113,536