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 listJun 21, 2025 14:38Valentin KofmanValentin KofmanScore: 76,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 14:3876,172660,252,176631,224,0001,000,0002,273,280
2Jun 21, 2025 14:3876,177661,929,310631,272,0001,000,0002,285,568
3Jun 21, 2025 14:3876,181658,916,353632,301,00002,285,568
4Jun 21, 2025 14:3876,208659,464,023630,529,0001,998,0002,379,776
5Jun 21, 2025 14:3876,222660,809,941630,641,0001,998,0002,277,376
6Jun 21, 2025 14:3876,227654,900,390631,683,000999,0002,285,568
7Jun 21, 2025 14:3876,227657,122,770630,685,0001,999,0002,285,568
8Jun 21, 2025 14:3876,318657,196,515631,441,0001,998,0002,281,472
9Jun 21, 2025 14:3876,372659,117,159632,892,000999,0002,285,568