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 29, 2025 12:55GabriellaGabriellaScore: 64,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 29, 2025 12:5564,106551,533,917530,082,0002,000,0002,527,232
2May 29, 2025 12:5564,120555,208,396532,198,00002,281,472
3May 29, 2025 12:5564,121559,086,999531,208,0001,000,0002,519,040
4May 29, 2025 12:5564,128551,742,489529,258,0003,001,0002,531,328
5May 29, 2025 12:5564,131557,902,999532,284,00002,527,232
6May 29, 2025 12:5564,133561,312,010531,309,000998,0002,527,232
7May 29, 2025 12:5564,147557,971,554531,418,0001,000,0002,527,232
8May 29, 2025 12:5564,156564,561,262531,495,000999,0002,424,832
9May 29, 2025 12:5564,172560,238,881530,626,0001,998,0002,424,832