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 5, 2026 20:25lipapipalipapipaScore: 75,232Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 20:2575,089647,735,599555,324,00067,917,000176,128
2Jan 5, 2026 20:2575,180651,363,604553,999,00069,999,000311,296
3Jan 5, 2026 20:2575,188654,131,275552,168,00071,891,000176,128
4Jan 5, 2026 20:2575,206647,712,759559,293,00064,917,000307,200
5Jan 5, 2026 20:2575,232655,095,595553,493,00070,935,000307,200
6Jan 5, 2026 20:2575,269649,902,932568,758,00055,976,000311,296
7Jan 5, 2026 20:2576,169714,585,794562,073,00070,133,00010,387,456
8Jan 5, 2026 20:2576,179699,494,834570,259,00062,028,0009,617,408
9Jan 5, 2026 20:2576,679734,709,563563,269,00073,164,00012,365,824