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 04:00CheckHarryCheckHarryScore: 3,839Success
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 04:003,81841,618,82130,684,0001,009,0002,113,536
2Sep 6, 2026 04:003,82441,641,17030,739,0001,008,0002,113,536
3Sep 6, 2026 04:003,83641,784,51530,821,0001,019,0002,113,536
4Sep 6, 2026 04:003,83641,697,20430,832,0001,012,0002,113,536
5Sep 6, 2026 04:003,83941,770,29630,857,0001,014,0002,113,536
6Sep 6, 2026 04:003,85741,938,63531,002,0001,013,0002,113,536
7Sep 6, 2026 04:003,87442,039,35131,128,0001,028,0002,113,536
8Sep 6, 2026 04:003,91142,347,41831,454,0001,009,0002,117,632
9Sep 6, 2026 04:003,99543,124,46832,158,0001,008,0002,113,536