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 listSep 23, 2026 10:15Kevin HeaveyKevin HeaveyScore: 3,288Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 10:173,22135,694,69925,562,0001,179,0002,113,536
2Sep 23, 2026 10:173,26247,793,38725,966,0001,111,0002,113,536
3Sep 23, 2026 10:173,27042,548,12825,999,0001,145,0002,113,536
4Sep 23, 2026 10:173,28346,401,75226,164,0001,091,0002,113,536
5Sep 23, 2026 10:173,28846,540,59026,210,0001,083,0002,113,536
6Sep 23, 2026 10:173,30944,308,74426,429,0001,039,0002,113,536
7Sep 23, 2026 10:173,32457,541,29426,545,0001,047,0002,113,536
8Sep 23, 2026 10:173,36947,960,48826,811,0001,159,0002,113,536
9Sep 23, 2026 10:173,38744,289,55426,982,0001,133,0002,113,536