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 listFeb 11, 2026 18:27olliecrowolliecrowScore: 6,384Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 18:275,95871,655,32547,433,0002,018,0002,326,528
2Feb 11, 2026 18:276,04878,548,16444,174,0006,023,0002,519,040
3Feb 11, 2026 18:276,12381,760,06042,851,0007,972,0002,465,792
4Feb 11, 2026 18:276,38480,820,65847,990,0004,998,0002,412,544
5Feb 11, 2026 18:276,43978,536,60548,399,0005,041,0002,428,928
6Feb 11, 2026 18:276,46578,425,85950,625,0003,037,0002,449,408