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 17:16Josu San MartinJosu San MartinScore: 6,995Success
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 17:166,89180,023,18356,192,0001,003,0002,293,760
2Jan 2, 2026 17:166,89379,649,66756,209,0001,003,0002,265,088
3Jan 2, 2026 17:166,96488,173,96056,804,000996,0002,265,088
4Jan 2, 2026 17:166,99586,545,68356,056,0002,002,0002,367,488
5Jan 2, 2026 17:167,02284,177,92656,277,0002,009,0002,363,392
6Jan 2, 2026 17:167,24786,136,68459,149,0001,002,0002,293,760