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 listSep 3, 2026 20:59Victor MerckléVictor MerckléScore: 4,211Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:004,05842,118,19332,633,0001,050,0002,113,536
2Sep 3, 2026 21:004,11542,584,02933,085,0001,075,0002,113,536
3Sep 3, 2026 21:004,15342,866,12433,442,0001,028,0002,113,536
4Sep 3, 2026 21:004,18844,602,14933,556,0001,207,0002,113,536
5Sep 3, 2026 21:004,21143,384,40233,905,0001,050,0002,113,536
6Sep 3, 2026 21:004,21943,465,15933,987,0001,033,0002,113,536
7Sep 3, 2026 21:004,23643,578,81734,116,0001,043,0002,113,536
8Sep 3, 2026 21:004,26543,833,95634,344,0001,056,0002,113,536
9Sep 3, 2026 21:004,27043,696,67034,302,0001,140,0002,113,536