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 19, 2026 15:31Victor MerckléVictor MerckléScore: 6,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 15:316,02959,474,62749,014,0001,030,0002,113,536
2May 19, 2026 15:316,03158,313,80949,038,0001,026,0002,113,536
3May 19, 2026 15:316,03458,994,48249,063,0001,027,0002,113,536
4May 19, 2026 15:316,03457,846,37049,066,0001,021,0002,113,536
5May 19, 2026 15:316,08059,207,47349,431,0001,034,0002,113,536
6May 19, 2026 15:316,14260,972,39449,967,0001,014,0002,113,536
7May 19, 2026 15:316,15259,629,91750,021,0001,044,0002,113,536
8May 19, 2026 15:316,18861,361,69350,319,0001,044,0002,113,536
9May 19, 2026 15:316,24161,669,96150,771,0001,032,0002,113,536