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 listMar 18, 2026 02:18Elijah KinElijah KinScore: 52,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 02:1952,284456,964,979429,960,0003,999,0002,265,088
2Mar 18, 2026 02:1952,294461,489,657433,040,0001,000,0002,273,280
3Mar 18, 2026 02:1952,315457,934,808434,218,00002,269,184
4Mar 18, 2026 02:1852,318455,389,853432,238,0002,001,0002,273,280
5Mar 18, 2026 02:1852,320460,959,121433,253,0001,000,0002,273,280
6Mar 18, 2026 02:1852,332464,807,585430,365,0003,994,0002,273,280