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 listJul 3, 2026 22:28Josu San MartinJosu San MartinScore: 15,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 22:3014,871133,006,320122,419,0001,011,0002,113,536
2Jul 3, 2026 22:3014,903133,144,913122,686,0001,016,0002,113,536
3Jul 3, 2026 22:3015,159135,410,940124,815,0001,007,0002,113,536
4Jul 3, 2026 22:3015,263136,322,928125,673,0001,014,0002,113,536
5Jul 3, 2026 22:3015,369137,191,688126,558,0001,012,0002,113,536
6Jul 3, 2026 22:3015,392137,248,747126,749,0001,007,0002,113,536
7Jul 3, 2026 22:3015,398137,358,053126,794,0001,012,0002,113,536
8Jul 3, 2026 22:3015,456138,376,748127,278,0001,007,0002,113,536
9Jul 3, 2026 22:3030,615263,722,437253,101,0001,008,0002,113,536