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 18:53Victor MerckléVictor MerckléScore: 5,853Success
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 18:535,83457,489,59246,303,0002,123,0002,117,632stderr
2Aug 28, 2026 18:535,83556,811,23246,333,0002,102,0002,117,632stderr
3Aug 28, 2026 18:535,83957,409,17446,417,0002,049,0002,117,632stderr
4Aug 28, 2026 18:535,84856,824,07046,513,0002,029,0002,117,632stderr
5Aug 28, 2026 18:535,85357,640,44146,420,0002,161,0002,117,632stderr
6Aug 28, 2026 18:535,85656,933,80346,492,0002,115,0002,117,632stderr
7Aug 28, 2026 18:535,86657,659,34546,617,0002,072,0002,117,632stderr
8Aug 28, 2026 18:535,89057,229,97246,756,0002,138,0002,117,632stderr
9Aug 28, 2026 18:535,91457,467,81846,950,0002,143,0002,117,632stderr