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 listApr 6, 2026 19:51Danylo MocherniukDanylo MocherniukScore: 5,867Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2026 19:515,82074,726,68746,293,0002,012,0002,297,856
2Apr 6, 2026 19:515,82877,798,15847,362,0001,007,0002,424,832
3Apr 6, 2026 19:515,83679,347,61347,433,0001,009,0002,297,856
4Apr 6, 2026 19:515,86173,870,32247,630,0001,013,0002,428,928
5Apr 6, 2026 19:515,86773,100,12547,680,0001,014,0002,297,856
6Apr 6, 2026 19:515,88381,430,98947,834,000996,0002,420,736
7Apr 6, 2026 19:515,88373,293,25646,838,0001,993,0002,297,856
8Apr 6, 2026 19:515,88476,461,98346,847,0001,993,0002,297,856
9Apr 6, 2026 19:515,93571,007,61846,245,0003,016,0002,416,640