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 listJan 31, 2026 00:12olliecrowolliecrowScore: 9,692Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 31, 2026 00:128,13893,525,41864,523,0003,024,0002,326,528
2Jan 31, 2026 00:128,29490,317,82767,827,0001,012,0002,428,928
3Jan 31, 2026 00:128,34790,653,51567,272,0002,008,0002,314,240
4Jan 31, 2026 00:129,588106,934,13872,530,0007,051,0002,502,656
5Jan 31, 2026 00:129,609108,344,28777,762,0001,993,0002,437,120
6Jan 31, 2026 00:129,658102,704,33677,156,0003,006,0002,400,256
7Jan 31, 2026 00:129,692103,770,83578,435,0002,011,0002,482,176
8Jan 31, 2026 00:129,730105,587,03279,764,000997,0002,482,176
9Jan 31, 2026 00:129,769107,425,00276,077,0005,005,0002,314,240
10Jan 31, 2026 00:129,924110,268,94980,361,0002,009,0002,510,848
11Jan 31, 2026 00:129,980101,394,68978,841,0003,991,0002,502,656
12Jan 31, 2026 00:129,982115,591,78579,857,0002,994,0002,473,984