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 19, 2026 17:41Ondřej PolaneckýOndřej PolaneckýScore: 7,260Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 17:427,14068,923,97051,507,0007,760,0002,117,632
2Jul 19, 2026 17:427,20469,421,34852,011,0007,786,0002,117,632
3Jul 19, 2026 17:427,24069,693,56951,930,0008,163,0002,117,632
4Jul 19, 2026 17:427,25671,221,21552,219,0008,006,0002,113,536
5Jul 19, 2026 17:427,26069,802,48252,115,0008,147,0002,117,632
6Jul 19, 2026 17:427,27570,011,69452,308,0008,078,0002,117,632
7Jul 19, 2026 17:427,29470,082,14852,813,0007,732,0002,113,536
8Jul 19, 2026 17:427,52172,022,72954,447,0007,981,0002,113,536
9Jul 19, 2026 17:427,63172,894,59155,071,0008,267,0002,117,632