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 11, 2025 17:47vahookvahookScore: 5,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2025 17:475,64070,881,11744,820,0001,992,0002,445,312
2May 11, 2025 17:475,66668,191,79644,026,0003,001,0002,437,120
3May 11, 2025 17:475,68968,977,16143,201,0004,018,0002,400,256
4May 11, 2025 17:475,70267,021,21744,304,0003,020,0002,527,232
5May 11, 2025 17:475,72768,452,83943,488,0004,045,0002,527,232
6May 11, 2025 17:475,79871,884,25443,111,0005,013,0002,404,352