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 listAug 28, 2026 19:47Victor MerckléVictor MerckléScore: 4,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:494,82049,072,81438,979,0001,032,0002,117,632stderr
2Aug 28, 2026 19:494,82549,035,70239,009,0001,040,0002,117,632stderr
3Aug 28, 2026 19:494,82648,335,61539,043,0001,021,0002,117,632stderr
4Aug 28, 2026 19:494,82950,375,50839,063,0001,021,0002,117,632stderr
5Aug 28, 2026 19:494,83048,464,06739,072,0001,024,0002,117,632stderr
6Aug 28, 2026 19:494,83848,522,81539,112,0001,046,0002,117,632stderr
7Aug 28, 2026 19:494,84349,231,00739,182,0001,021,0002,117,632stderr
8Aug 28, 2026 19:494,86348,492,94039,331,0001,035,0002,117,632stderr
9Aug 28, 2026 19:494,96849,710,04440,208,0001,033,0002,117,632stderr