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 20, 2026 15:51Victor MerckléVictor MerckléScore: 5,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 15:535,55055,632,69144,995,0001,072,0002,113,536
2May 20, 2026 15:535,57860,390,19445,185,0001,115,0002,113,536
3May 20, 2026 15:535,58254,259,44645,303,0001,031,0002,113,536
4May 20, 2026 15:535,58257,258,60945,320,0001,013,0002,113,536
5May 20, 2026 15:535,58554,190,46045,307,0001,053,0002,113,536
6May 20, 2026 15:535,59954,373,31445,468,0001,005,0002,113,536
7May 20, 2026 15:535,60954,376,50045,483,0001,074,0002,113,536
8May 20, 2026 15:535,61456,348,14445,600,0001,004,0002,113,536
9May 20, 2026 15:535,67456,706,29346,035,0001,066,0002,113,536