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 listAug 26, 2026 19:42Victor MerckléVictor MerckléScore: 3,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 19:423,75839,386,85630,051,0001,146,0002,113,536
2Aug 26, 2026 19:423,77039,604,66130,140,0001,153,0002,113,536
3Aug 26, 2026 19:423,78740,943,19430,375,0001,065,0002,113,536
4Aug 26, 2026 19:423,79139,806,44430,337,0001,131,0002,113,536
5Aug 26, 2026 19:423,80839,891,51030,516,0001,098,0002,113,536
6Aug 26, 2026 19:423,81840,697,41630,571,0001,123,0002,113,536
7Aug 26, 2026 19:423,98141,364,66731,988,0001,061,0002,113,536
8Aug 26, 2026 19:424,02042,961,86832,298,0001,072,0002,113,536
9Aug 26, 2026 19:424,07642,915,45632,767,0001,068,0002,113,536