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 listSep 3, 2025 21:40Adam FolwarcznyAdam FolwarcznyScore: 7,413Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2025 21:407,22980,666,43340,000,00020,000,0002,347,008
2Sep 3, 2025 21:407,26283,348,88545,207,00015,069,0002,375,680
3Sep 3, 2025 21:407,27579,616,23145,290,00015,096,0002,273,280
4Sep 3, 2025 21:407,34179,641,43444,950,00015,982,0002,535,424
5Sep 3, 2025 21:407,36085,985,11545,064,00016,023,0002,539,520
6Sep 3, 2025 21:407,38387,607,99745,208,00016,073,0002,531,328
7Sep 3, 2025 21:407,41385,021,72849,421,00012,103,0002,281,472
8Sep 3, 2025 21:407,41991,282,86547,443,00014,132,0002,281,472
9Sep 3, 2025 21:407,44585,115,30346,843,00014,950,0002,412,544
10Sep 3, 2025 21:407,44690,414,40946,848,00014,951,0002,371,584
11Sep 3, 2025 21:407,50083,953,11844,176,00018,072,0002,342,912
12Sep 3, 2025 21:407,51588,908,70448,290,00014,084,0002,531,328