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: 4,002Success
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:123,99044,204,41432,112,0001,013,0002,113,536
2Sep 6, 2026 12:123,99742,978,41332,154,0001,023,0002,113,536
3Sep 6, 2026 12:123,99843,091,19932,176,0001,014,0002,113,536
4Sep 6, 2026 12:123,99943,107,99332,183,0001,013,0002,113,536
5Sep 6, 2026 12:124,00243,114,61632,204,0001,018,0002,113,536
6Sep 6, 2026 12:124,00943,038,50732,253,0001,022,0002,113,536
7Sep 6, 2026 12:124,01443,152,32932,305,0001,014,0002,113,536
8Sep 6, 2026 12:124,04643,505,88732,577,0001,012,0002,113,536
9Sep 6, 2026 12:124,05043,602,78932,602,0001,014,0002,113,536