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 5, 2026 04:45Josu San MartinJosu San MartinScore: 5,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 5, 2026 04:455,76568,001,64445,855,0001,993,0002,535,424
2Feb 5, 2026 04:455,90976,817,63847,040,0002,001,0002,273,280
3Feb 5, 2026 04:455,95173,015,39848,384,0001,008,0002,441,216
4Feb 5, 2026 04:455,98078,693,74448,619,0001,012,0002,437,120
5Feb 5, 2026 04:456,05172,711,59348,217,0002,009,0002,285,568
6Feb 5, 2026 04:456,15572,536,03649,080,0002,003,0002,273,280