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 listApr 17, 2026 12:45wnwnScore: 10,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 12:4510,431110,412,25285,570,0001,006,0002,269,184
2Apr 17, 2026 12:4510,489112,663,22986,059,0001,000,0002,293,760
3Apr 17, 2026 12:4510,622110,788,63086,156,0002,003,0002,293,760