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 listMay 12, 2026 03:17cashkarucashkaruScore: 31,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 03:1731,429269,796,980259,859,0001,007,0002,113,536
2May 12, 2026 03:1731,435270,720,013259,907,0001,006,0002,113,536
3May 12, 2026 03:1731,453272,028,061260,060,0001,006,0002,113,536
4May 12, 2026 03:1731,468271,859,855260,183,0001,008,0002,113,536
5May 12, 2026 03:1731,470269,967,810260,201,0001,006,0002,113,536
6May 12, 2026 03:1731,495271,605,885260,403,0001,008,0002,113,536
7May 12, 2026 03:1731,507272,371,712260,501,0001,008,0002,113,536
8May 12, 2026 03:1731,508270,292,229260,514,0001,009,0002,113,536
9May 12, 2026 03:1731,513271,273,302260,559,0001,007,0002,113,536