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 5, 2026 17:23Kevin HeaveyKevin HeaveyScore: 6,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 17:246,40462,589,90951,960,0001,198,0002,117,632
2Jul 5, 2026 17:246,41162,819,57852,018,0001,200,0002,117,632
3Jul 5, 2026 17:246,41162,818,49951,997,0001,217,0002,117,632
4Jul 5, 2026 17:246,42462,914,35752,113,0001,214,0002,117,632
5Jul 5, 2026 17:246,47363,208,84252,575,0001,151,0002,117,632
6Jul 5, 2026 17:246,51563,685,08352,853,0001,229,0002,117,632
7Jul 5, 2026 17:246,55263,959,50753,173,0001,209,0002,117,632
8Jul 5, 2026 17:246,58464,199,72053,471,0001,177,0002,117,632
9Jul 5, 2026 17:246,58864,231,64453,480,0001,208,0002,117,632