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 17, 2026 09:30M-RochatM-RochatScore: 12,689Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 09:3012,613115,166,229102,520,0002,174,0002,113,536
2May 17, 2026 09:3012,624115,852,694102,540,0002,243,0002,113,536
3May 17, 2026 09:3012,631115,529,651102,658,0002,186,0002,113,536
4May 17, 2026 09:3012,681116,082,282103,082,0002,174,0002,113,536
5May 17, 2026 09:3012,689114,949,734103,129,0002,194,0002,113,536
6May 17, 2026 09:3012,696115,837,027103,128,0002,253,0002,113,536
7May 17, 2026 09:3012,697114,052,616103,208,0002,183,0002,113,536
8May 17, 2026 09:3012,755116,411,474103,652,0002,218,0002,113,536
9May 17, 2026 09:3012,768114,793,686102,780,0003,198,0002,113,536