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 listApr 13, 2026 13:21wnwnScore: 5,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 13:215,13868,017,29041,627,0001,015,0002,490,368
2Apr 13, 2026 13:215,17061,394,77740,912,0001,995,0002,531,328
3Apr 13, 2026 13:215,17366,556,26440,937,0001,996,0002,486,272