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 20, 2025 07:28sheryllynn24sheryllynn24Score: 14,095Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 07:2814,073148,675,878115,806,000998,0002,285,568
2Sep 20, 2025 07:2814,083142,375,514114,889,0001,998,0002,285,568
3Sep 20, 2025 07:2814,089143,737,356114,938,0001,998,0002,265,088
4Sep 20, 2025 07:2814,091143,608,332114,955,0001,999,0002,285,568
5Sep 20, 2025 07:2814,095141,550,425114,987,0001,999,0002,273,280
6Sep 20, 2025 07:2814,219143,999,536117,021,0001,000,0002,260,992
7Sep 20, 2025 07:2814,230147,234,381116,105,0002,001,0002,285,568
8Sep 20, 2025 07:2814,233148,365,691117,130,0001,001,0002,523,136
9Sep 20, 2025 07:2814,248144,665,922116,255,0002,004,0002,285,568