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 17:39Victor MerckléVictor MerckléScore: 69,990Success
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 17:3969,817589,285,195578,337,0001,147,0002,117,632stderr
2May 13, 2026 17:3969,845587,516,091578,572,0001,142,0002,117,632stderr
3May 13, 2026 17:3969,898591,610,863579,128,0001,031,0002,117,632stderr
4May 13, 2026 17:3969,946588,625,309579,392,0001,163,0002,117,632stderr
5May 13, 2026 17:3969,990588,284,056579,761,0001,156,0002,117,632stderr
6May 13, 2026 17:3970,024588,697,560580,194,0001,011,0002,117,632stderr
7May 13, 2026 17:3970,357592,567,086582,813,0001,155,0002,117,632stderr
8May 13, 2026 17:3970,407593,327,737583,344,0001,035,0002,117,632stderr
9May 13, 2026 17:3970,581594,153,767584,551,0001,272,0002,117,632stderr