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 27, 2026 02:42Victor MerckléVictor MerckléScore: 3,989Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:423,95341,110,47531,677,0001,134,0002,117,632stderr
2Aug 27, 2026 02:423,96041,184,39431,709,0001,165,0002,117,632stderr
3Aug 27, 2026 02:423,97041,351,51531,828,0001,127,0002,117,632stderr
4Aug 27, 2026 02:423,98241,344,05631,922,0001,130,0002,117,632stderr
5Aug 27, 2026 02:423,98941,437,93532,023,0001,089,0002,117,632stderr
6Aug 27, 2026 02:423,99741,500,30832,090,0001,086,0002,117,632stderr
7Aug 27, 2026 02:423,99841,462,91832,112,0001,078,0002,117,632stderr
8Aug 27, 2026 02:424,01441,668,06832,305,0001,013,0002,117,632stderr
9Aug 27, 2026 02:424,25343,553,80334,245,0001,060,0002,117,632stderr