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 listSep 7, 2026 23:49Victor MerckléVictor MerckléScore: 4,300Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 23:514,26944,658,51731,299,0004,141,00024,576stderr
2Sep 7, 2026 23:514,27144,696,66631,478,0003,979,00024,576stderr
3Sep 7, 2026 23:514,28644,121,65231,004,0004,576,00024,576stderr
4Sep 7, 2026 23:514,29147,316,53031,075,0004,548,00024,576stderr
5Sep 7, 2026 23:514,30044,256,75431,212,0004,478,0002,117,632stderr
6Sep 7, 2026 23:514,30744,274,31731,164,0004,590,0002,117,632stderr
7Sep 7, 2026 23:514,33044,437,35031,216,0004,729,0002,117,632stderr
8Sep 7, 2026 23:514,36044,789,40731,299,0004,893,0002,117,632stderr
9Sep 7, 2026 23:514,36844,810,26131,296,0004,959,0002,117,632stderr