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 listJul 17, 2026 18:33Kevin HeaveyKevin HeaveyScore: 3,674Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 18:343,60939,704,33028,762,0001,200,0002,117,632
2Jul 17, 2026 18:343,62339,835,35628,865,0001,214,0002,117,632
3Jul 17, 2026 18:343,64439,984,85929,013,0001,237,0002,117,632
4Jul 17, 2026 18:343,66540,195,69429,187,0001,237,0002,117,632
5Jul 17, 2026 18:343,67440,275,30429,435,0001,064,0002,117,632
6Jul 17, 2026 18:343,69340,357,39229,422,0001,232,0002,117,632
7Jul 17, 2026 18:343,88341,939,36331,193,0001,043,0002,117,632
8Jul 17, 2026 18:343,91742,312,17031,305,0001,212,0002,117,632
9Jul 17, 2026 18:343,93842,399,19831,653,0001,038,0002,117,632