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 listAug 2, 2026 20:48TonyTonyScore: 8,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:488,26578,430,44366,142,0002,460,0002,113,536
2Aug 2, 2026 20:488,34279,716,01366,589,0002,656,0002,113,536
3Aug 2, 2026 20:488,34879,126,32466,647,0002,643,0002,113,536
4Aug 2, 2026 20:488,35479,141,50466,800,0002,539,0002,113,536
5Aug 2, 2026 20:488,36379,285,81766,744,0002,672,0002,113,536
6Aug 2, 2026 20:488,37579,320,18266,857,0002,661,0002,113,536
7Aug 2, 2026 20:488,39079,405,24466,991,0002,652,0002,113,536
8Aug 2, 2026 20:488,42179,687,83567,191,0002,707,0002,117,632
9Aug 2, 2026 20:488,42679,821,06567,304,0002,633,0002,113,536