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 14, 2026 00:49Victor MerckléVictor MerckléScore: 7,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 00:497,58870,262,04162,987,00002,113,536
2May 14, 2026 00:497,58973,179,51062,991,00002,113,536
3May 14, 2026 00:497,59470,391,95562,032,0001,005,0002,113,536
4May 14, 2026 00:497,59672,555,95662,043,0001,005,0002,113,536
5May 14, 2026 00:497,59972,264,17762,050,0001,022,0002,113,536
6May 14, 2026 00:497,60970,922,61762,147,0001,008,0002,113,536
7May 14, 2026 00:497,61672,004,04962,176,0001,043,0002,113,536
8May 14, 2026 00:497,61772,317,46762,213,0001,014,0002,113,536
9May 14, 2026 00:497,62870,785,37362,294,0001,019,0002,113,536