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 16, 2026 00:23Victor MerckléVictor MerckléScore: 6,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 00:286,97865,383,49556,904,0001,014,0002,113,536
2May 16, 2026 00:286,98067,076,64356,930,0001,009,0002,113,536
3May 16, 2026 00:286,98265,850,28956,907,0001,045,0002,113,536
4May 16, 2026 00:286,98365,907,89856,959,0001,005,0002,113,536
5May 16, 2026 00:286,98467,203,66756,951,0001,017,0002,113,536
6May 16, 2026 00:286,98665,310,08057,989,00002,113,536
7May 16, 2026 00:286,98767,042,85356,969,0001,031,0002,113,536
8May 16, 2026 00:286,99066,935,21157,008,0001,011,0002,113,536
9May 16, 2026 00:286,99866,633,03057,053,0001,032,0002,113,536