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 listNov 3, 2026 02:19Andrew EpsteinAndrew EpsteinScore: 3,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 02:233,40537,529,37127,227,0001,040,0002,113,536
2Nov 3, 2026 02:233,47938,131,36927,844,0001,037,0002,113,536
3Nov 3, 2026 02:233,49738,406,28327,998,0001,035,0002,113,536
4Nov 3, 2026 02:233,54638,676,67628,434,0001,006,0002,113,536
5Nov 3, 2026 02:233,56138,836,68428,529,0001,030,0002,113,536
6Nov 3, 2026 02:233,56538,895,21728,574,0001,016,0002,113,536
7Nov 3, 2026 02:233,56639,273,69128,573,0001,028,0002,113,536
8Nov 3, 2026 02:233,58338,986,79228,705,0001,037,0002,113,536
9Nov 3, 2026 02:233,59539,172,54828,769,0001,070,0002,113,536