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 listOct 10, 2022 16:08ekilockekilockScore: 1,640,566Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2022 16:081,632,13713,620,306,47813,546,737,92902,256,896
2Oct 10, 2022 16:081,640,56613,677,035,09713,616,695,60802,269,184
3Oct 10, 2022 16:081,650,29613,767,518,11013,697,453,48002,265,088