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 10, 2026 12:56Victor MerckléVictor MerckléScore: 9,035Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:578,88381,328,17272,696,0001,038,0002,117,632stderr
2Jun 10, 2026 12:578,88881,349,52872,685,0001,088,0002,117,632stderr
3Jun 10, 2026 12:578,98982,403,66573,600,0001,012,0002,117,632stderr
4Jun 10, 2026 12:579,01682,573,42673,769,0001,069,0002,117,632stderr
5Jun 10, 2026 12:579,03582,432,24973,943,0001,049,0002,117,632stderr
6Jun 10, 2026 12:579,14283,713,55074,850,0001,030,0002,117,632stderr
7Jun 10, 2026 12:579,24684,691,17675,710,0001,038,0002,117,632stderr
8Jun 10, 2026 12:579,28384,750,55676,022,0001,031,0002,117,632stderr
9Jun 10, 2026 12:579,34184,935,36676,497,0001,035,0002,117,632stderr