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 18:36Victor MerckléVictor MerckléScore: 4,637Success
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 18:364,59848,479,81737,134,0001,031,0002,117,632stderr
2Aug 10, 2026 18:364,59947,217,19737,150,0001,026,0002,117,632stderr
3Aug 10, 2026 18:364,60846,615,08237,225,0001,028,0002,117,632stderr
4Aug 10, 2026 18:364,61546,619,65337,287,0001,025,0002,117,632stderr
5Aug 10, 2026 18:364,63746,825,79837,465,0001,030,0002,117,632stderr
6Aug 10, 2026 18:364,63847,560,09736,494,0002,005,0002,117,632stderr
7Aug 10, 2026 18:364,65347,696,30636,606,0002,015,0002,117,632stderr
8Aug 10, 2026 18:364,71247,486,80038,086,0001,024,0002,117,632stderr
9Aug 10, 2026 18:364,75847,813,82138,473,0001,023,0002,117,632stderr