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 10, 2026 16:42Victor MerckléVictor MerckléScore: 4,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 16:444,10442,676,69533,054,0001,015,0002,117,632stderr
2Aug 10, 2026 16:444,11642,353,97533,004,0001,159,0002,117,632stderr
3Aug 10, 2026 16:444,11942,395,83133,062,0001,131,0002,117,632stderr
4Aug 10, 2026 16:444,12342,551,68733,122,0001,099,0002,117,632stderr
5Aug 10, 2026 16:444,12342,388,07833,113,0001,111,0002,117,632stderr
6Aug 10, 2026 16:444,13942,590,65633,340,0001,019,0002,117,632stderr
7Aug 10, 2026 16:444,14042,647,61233,261,0001,102,0002,117,632stderr
8Aug 10, 2026 16:444,14243,454,17133,264,0001,120,0002,117,632stderr
9Aug 10, 2026 16:444,21243,260,14233,932,0001,035,0002,117,632stderr