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 5, 2026 05:00Josu San MartinJosu San MartinScore: 5,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 05:005,58866,865,15045,374,0001,008,0002,437,120
2Feb 5, 2026 05:005,66071,012,36244,983,0001,999,0002,441,216
3Feb 5, 2026 05:005,79575,851,17146,093,0002,004,0002,445,312
4Feb 5, 2026 05:005,88383,273,31546,838,0001,993,0002,441,216
5Feb 5, 2026 05:005,97776,564,78248,594,0001,012,0002,441,216
6Feb 5, 2026 05:006,00073,631,58348,808,000996,0002,441,216