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 02:32f0xerif0xeriScore: 32,232Success
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 02:3232,161276,389,757203,328,00063,609,0002,113,536
2Jul 3, 2026 02:3232,186276,505,590203,416,00063,731,0002,113,536
3Jul 3, 2026 02:3232,186276,596,719203,635,00063,516,0002,113,536
4Jul 3, 2026 02:3232,201276,743,591203,791,00063,480,0002,113,536
5Jul 3, 2026 02:3232,232276,950,398203,713,00063,820,0002,113,536
6Jul 3, 2026 02:3232,260277,097,940203,765,00063,995,0002,113,536
7Jul 3, 2026 02:3232,337277,741,348203,906,00064,495,0002,113,536
8Jul 3, 2026 02:3232,354277,873,939203,995,00064,548,0002,113,536
9Jul 3, 2026 02:3232,359279,298,483204,095,00064,487,0002,113,536