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 13, 2026 00:55Victor MerckléVictor MerckléScore: 11,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 00:5610,96199,418,87185,439,0005,544,0002,117,632stderr
2Aug 13, 2026 00:5610,96699,458,24085,709,0005,312,0002,117,632stderr
3Aug 13, 2026 00:5610,98699,609,62285,562,0005,626,0002,117,632stderr
4Aug 13, 2026 00:5610,99299,618,70286,087,0005,153,0002,117,632stderr
5Aug 13, 2026 00:5611,01299,824,58286,003,0005,402,0002,117,632stderr
6Aug 13, 2026 00:5611,03399,993,77886,435,0005,142,0002,117,632stderr
7Aug 13, 2026 00:5611,034100,067,22585,915,0005,668,0002,117,632stderr
8Aug 13, 2026 00:5611,041100,153,08986,064,0005,579,0002,117,632stderr
9Aug 13, 2026 00:5611,046100,537,85286,214,0005,474,0002,117,632stderr