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 6, 2025 16:08Aleksei ShahoikaAleksei ShahoikaScore: 67,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2025 16:0867,429579,218,185558,658,000999,0002,367,488
2Sep 6, 2025 16:0867,431581,522,481558,678,000999,0002,273,280
3Sep 6, 2025 16:0867,444583,048,346557,790,0001,999,0002,285,568
4Sep 6, 2025 16:0867,446582,099,669558,799,000999,0002,285,568
5Sep 6, 2025 16:0867,483582,987,727559,111,0001,000,0002,265,088
6Sep 6, 2025 16:0867,484580,142,185559,115,0001,000,0002,285,568
7Sep 6, 2025 16:0867,488585,240,656560,154,00002,265,088
8Sep 6, 2025 16:0867,498583,092,796559,231,0001,000,0002,285,568
9Sep 6, 2025 16:0867,550588,459,682558,664,0001,998,0002,285,568