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 listJun 25, 2026 06:22wnwnScore: 3,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 06:233,34935,348,06526,659,0001,138,0002,113,536
2Jun 25, 2026 06:233,35235,409,99726,784,0001,040,0002,113,536
3Jun 25, 2026 06:233,39535,616,73427,061,0001,118,0002,113,536
4Jun 25, 2026 06:233,42836,189,18027,440,0001,016,0002,113,536
5Jun 25, 2026 06:233,44636,270,58927,589,0001,018,0002,113,536
6Jun 25, 2026 06:233,44736,666,38127,580,0001,032,0002,113,536
7Jun 25, 2026 06:233,45336,654,64027,621,0001,042,0002,113,536
8Jun 25, 2026 06:233,45836,600,04927,685,0001,019,0002,113,536
9Jun 25, 2026 06:233,46936,307,11627,753,0001,044,0002,113,536