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 10, 2026 09:07wnwnScore: 3,499Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 09:083,36335,812,35226,885,0001,032,0002,113,536
2Jul 10, 2026 09:083,36435,891,14326,890,0001,037,0002,113,536
3Jul 10, 2026 09:083,37136,021,11826,945,0001,039,0002,113,536
4Jul 10, 2026 09:083,37536,087,11526,954,0001,061,0002,113,536
5Jul 10, 2026 09:083,49936,852,30828,011,0001,038,0002,113,536
6Jul 10, 2026 09:083,50437,096,86628,055,0001,034,0002,113,536
7Jul 10, 2026 09:083,51637,009,92428,159,0001,026,0002,113,536
8Jul 10, 2026 09:083,52337,206,07728,206,0001,041,0002,113,536
9Jul 10, 2026 09:083,54037,431,32228,363,0001,021,0002,113,536