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:58Victor MerckléVictor MerckléScore: 6,956Success
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:586,94664,985,75556,615,0001,042,0002,113,536
2May 16, 2026 03:586,95165,665,44356,672,0001,023,0002,113,536
3May 16, 2026 03:586,95166,040,70656,691,0001,004,0002,113,536
4May 16, 2026 03:586,95667,024,34556,734,0001,009,0002,113,536
5May 16, 2026 03:586,95667,527,04956,715,0001,027,0002,113,536
6May 16, 2026 03:586,97666,886,40756,880,0001,022,0002,113,536
7May 16, 2026 03:587,00866,005,34258,174,00002,113,536
8May 16, 2026 03:587,06668,957,43257,623,0001,026,0002,113,536
9May 16, 2026 03:587,13368,111,19958,202,0001,009,0002,113,536