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 listJan 2, 2026 04:14Josu San MartinJosu San MartinScore: 7,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:147,26892,373,58457,310,0003,016,0002,445,312
2Jan 2, 2026 04:147,39684,918,91759,371,0002,012,0002,379,776
3Jan 2, 2026 04:147,40794,144,79858,451,0003,023,0002,301,952
4Jan 2, 2026 04:147,41389,175,77757,494,0004,034,0002,420,736
5Jan 2, 2026 04:147,44788,359,51459,818,0001,993,0002,506,752
6Jan 2, 2026 04:147,49188,650,86060,172,0002,005,0002,473,984