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 16, 2026 03:03Victor MerckléVictor MerckléScore: 52,347Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 03:0452,322442,074,016433,269,0001,005,0002,113,536
2May 16, 2026 03:0452,341444,135,219433,433,0001,005,0002,113,536
3May 16, 2026 03:0452,341441,793,870433,430,0001,004,0002,113,536
4May 16, 2026 03:0452,344443,891,118433,457,0001,004,0002,113,536
5May 16, 2026 03:0452,347442,776,336433,483,0001,003,0002,113,536
6May 16, 2026 03:0452,347444,755,932433,481,0001,003,0002,113,536
7May 16, 2026 03:0452,352441,925,208433,519,0001,003,0002,113,536
8May 16, 2026 03:0452,356444,043,828433,551,0001,005,0002,113,536
9May 16, 2026 03:0452,366443,429,457433,639,0001,004,0002,113,536