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 17:13Victor MerckléVictor MerckléScore: 4,097Success
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 17:144,08542,363,82932,891,0001,021,0002,117,632stderr
2Aug 10, 2026 17:144,09043,692,04632,940,0001,009,0002,117,632stderr
3Aug 10, 2026 17:144,09242,286,44332,862,0001,106,0002,117,632stderr
4Aug 10, 2026 17:144,09442,373,02032,864,0001,121,0002,117,632stderr
5Aug 10, 2026 17:144,09742,411,68432,909,0001,101,0002,117,632stderr
6Aug 10, 2026 17:144,11642,544,51133,144,0001,024,0002,117,632stderr
7Aug 10, 2026 17:144,12442,683,54533,121,0001,114,0002,117,632stderr
8Aug 10, 2026 17:144,24743,660,16734,141,0001,110,0002,117,632stderr
9Aug 10, 2026 17:144,25643,675,12934,262,0001,066,0002,117,632stderr