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 19:10olliecrowolliecrowScore: 6,272Success
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 19:105,90380,554,72045,997,0002,999,0002,301,952
2Feb 11, 2026 19:105,90671,990,86443,016,0006,002,0002,482,176
3Feb 11, 2026 19:105,91074,907,36646,046,0003,003,0002,396,160
4Feb 11, 2026 19:106,27281,038,39549,058,0003,003,0002,449,408
5Feb 11, 2026 19:106,31779,132,44550,414,0002,016,0002,359,296
6Feb 11, 2026 19:106,45385,195,28150,525,0003,031,0002,273,280