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 listMay 13, 2026 08:24Victor MerckléVictor MerckléScore: 7,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 08:257,91972,969,77364,684,0001,046,0002,113,536
2May 13, 2026 08:257,91973,079,04264,721,0001,010,0002,113,536
3May 13, 2026 08:257,92074,758,61864,707,0001,035,0002,113,536
4May 13, 2026 08:257,92278,295,32464,733,0001,026,0002,113,536
5May 13, 2026 08:257,92273,030,19064,687,0001,071,0002,113,536
6May 13, 2026 08:257,92873,173,26064,786,0001,018,0002,113,536
7May 13, 2026 08:257,92973,725,06064,808,0001,009,0002,113,536
8May 13, 2026 08:257,93974,698,14864,842,0001,053,0002,113,536
9May 13, 2026 08:258,04574,515,38565,769,0001,005,0002,113,536