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:10Victor MerckléVictor MerckléScore: 4,901Success
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:104,86448,711,16839,233,0001,139,0002,117,632stderr
2Aug 27, 2026 02:104,88749,098,87739,435,0001,135,0002,117,632stderr
3Aug 27, 2026 02:104,88948,789,89839,454,0001,128,0002,117,632stderr
4Aug 27, 2026 02:104,89148,896,80539,442,0001,156,0002,117,632stderr
5Aug 27, 2026 02:104,90148,925,09439,519,0001,161,0002,117,632stderr
6Aug 27, 2026 02:104,91549,104,14839,704,0001,095,0002,117,632stderr
7Aug 27, 2026 02:104,92249,155,60839,780,0001,073,0002,117,632stderr
8Aug 27, 2026 02:104,95149,570,93939,947,0001,154,0002,117,632stderr
9Aug 27, 2026 02:105,03350,109,92440,718,0001,061,0002,117,632stderr