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 listMar 26, 2026 05:25poyo180605poyo180605Score: 2,067,864Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 05:252,066,33817,181,893,31117,072,643,00077,966,0002,289,664
2Mar 26, 2026 05:252,066,51617,190,574,45817,089,105,00062,974,0002,281,472
3Mar 26, 2026 05:252,067,03017,189,290,92317,093,381,00062,971,0002,289,664
4Mar 26, 2026 05:252,067,76017,196,957,14817,093,439,00068,973,0002,281,472
5Mar 26, 2026 05:252,067,86417,203,862,18717,102,302,00060,972,0002,281,472
6Mar 26, 2026 05:252,067,98017,190,657,29717,096,269,00067,965,0002,281,472
7Mar 26, 2026 05:252,068,09317,204,867,49517,096,209,00068,964,0002,293,760
8Mar 26, 2026 05:252,068,95417,206,658,01517,104,351,00067,969,0002,281,472
9Mar 26, 2026 05:252,267,18518,848,158,06418,762,657,00054,978,0002,281,472