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 13, 2026 19:57Victor MerckléVictor MerckléScore: 7,695Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 19:587,69073,253,48663,831,00002,113,536
2May 13, 2026 19:587,69273,971,56462,846,0001,005,0002,113,536
3May 13, 2026 19:587,69473,571,46963,865,00002,113,536
4May 13, 2026 19:587,69471,167,71362,855,0001,010,0002,113,536
5May 13, 2026 19:587,69573,063,34663,874,00002,113,536
6May 13, 2026 19:587,69673,951,71162,837,0001,047,0002,113,536
7May 13, 2026 19:587,70071,851,49662,867,0001,045,0002,113,536
8May 13, 2026 19:587,70173,917,54262,911,0001,010,0002,113,536
9May 13, 2026 19:587,70574,291,93862,939,0001,014,0002,113,536