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 listApr 25, 2026 18:22olliecrowolliecrowScore: 6,359Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 18:236,26871,886,42449,028,0003,001,0002,359,296
2Apr 25, 2026 18:236,30070,988,37549,276,0003,016,0002,539,520
3Apr 25, 2026 18:236,32669,938,72345,440,0007,068,0002,510,848
4Apr 25, 2026 18:236,35270,332,88549,742,0002,984,0002,428,928
5Apr 25, 2026 18:236,35966,193,60849,793,0002,987,0002,506,752
6Apr 25, 2026 18:236,37871,838,62750,942,0001,997,0002,523,136
7Apr 25, 2026 18:236,38672,269,26246,007,0007,001,0002,404,352
8Apr 25, 2026 18:236,39674,784,94247,080,0006,010,0002,408,448
9Apr 25, 2026 18:236,40971,644,66451,195,0002,007,0002,400,256