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 05:30CheckHarryCheckHarryScore: 5,430Success
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 05:305,41054,821,34842,869,0002,036,0002,113,536
2Sep 3, 2026 05:305,42054,782,74143,965,0001,022,0002,113,536
3Sep 3, 2026 05:305,42154,906,40642,953,0002,048,0002,113,536
4Sep 3, 2026 05:305,42755,039,73243,003,0002,048,0002,113,536
5Sep 3, 2026 05:305,43054,938,14443,024,0002,052,0002,113,536
6Sep 3, 2026 05:305,43154,978,95943,036,0002,046,0002,113,536
7Sep 3, 2026 05:305,43754,956,09143,120,0002,015,0002,113,536
8Sep 3, 2026 05:305,44855,163,06043,180,0002,040,0002,113,536
9Sep 3, 2026 05:305,44955,211,95643,209,0002,023,0002,113,536