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 listJun 25, 2026 17:19Victor MerckléVictor MerckléScore: 4,231Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 17:214,21642,548,86333,882,0001,115,0002,113,536
2Jun 25, 2026 17:214,22442,546,75933,981,0001,084,0002,113,536
3Jun 25, 2026 17:214,22643,028,01633,961,0001,122,0002,113,536
4Jun 25, 2026 17:214,22842,578,62033,990,0001,109,0002,113,536
5Jun 25, 2026 17:214,23142,636,16334,009,0001,114,0002,113,536
6Jun 25, 2026 17:214,24742,720,87834,128,0001,125,0002,113,536
7Jun 25, 2026 17:214,28943,105,57534,378,0001,222,0002,113,536
8Jun 25, 2026 17:214,35943,652,54335,080,0001,100,0002,113,536
9Jun 25, 2026 17:214,36843,706,71135,146,0001,109,0002,113,536