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 21:45Josu San MartinJosu San MartinScore: 6,803Success
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 21:456,41478,887,12851,226,0002,008,0002,478,080
2Jan 2, 2026 21:456,51181,642,63049,041,0005,004,0002,334,720
3Jan 2, 2026 21:456,54581,475,83451,304,0003,017,0002,347,008
4Jan 2, 2026 21:456,80375,561,78055,461,0001,008,0002,351,104
5Jan 2, 2026 21:456,96683,626,56856,820,000996,0002,301,952
6Jan 2, 2026 21:457,02388,522,03653,265,0005,025,0002,498,560