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 listMay 25, 2026 20:12Maya RebholzMaya RebholzScore: 6,336Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 20:126,15563,418,06745,968,0005,123,0002,113,536
2May 25, 2026 20:126,21362,767,07346,494,0005,081,0002,117,632
3May 25, 2026 20:126,26162,220,06246,412,0005,557,0002,117,632
4May 25, 2026 20:126,31665,493,99146,938,0005,486,0002,113,536
5May 25, 2026 20:126,33664,747,37447,154,0005,443,0002,117,632
6May 25, 2026 20:126,38263,361,30947,313,0005,659,0002,117,632
7May 25, 2026 20:126,42165,315,36147,772,0005,525,0002,113,536
8May 25, 2026 20:126,54566,498,49348,888,0005,438,0002,117,632
9May 25, 2026 20:126,55766,492,53648,900,0005,527,0002,117,632