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 18:18vahookvahookScore: 5,486Success
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 18:185,35468,909,16141,411,0003,030,0002,416,640
2May 11, 2025 18:185,44667,353,84440,179,0005,022,0002,465,792
3May 11, 2025 18:185,47070,616,03041,365,0004,035,0002,428,928
4May 11, 2025 18:185,48666,839,68942,499,0003,035,0002,428,928
5May 11, 2025 18:185,48875,486,71843,525,0002,024,0002,527,232
6May 11, 2025 18:185,52972,831,39140,903,0004,988,0002,424,832