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 12:10CheckHarryCheckHarryScore: 3,995Success
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 12:113,97342,839,65131,971,0001,008,0002,113,536
2Sep 6, 2026 12:113,97642,820,47631,985,0001,021,0002,117,632
3Sep 6, 2026 12:113,98453,846,33532,036,0001,036,0002,117,632
4Sep 6, 2026 12:113,99043,021,61332,113,0001,009,0002,113,536
5Sep 6, 2026 12:113,99543,006,06332,150,0001,011,0002,113,536
6Sep 6, 2026 12:113,99543,135,42332,093,0001,067,0002,113,536
7Sep 6, 2026 12:114,01943,167,25232,224,0001,137,0002,113,536
8Sep 6, 2026 12:114,05443,580,11732,643,0001,010,0002,113,536
9Sep 6, 2026 12:114,27454,812,81134,424,0001,053,0002,113,536