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 2, 2026 19:54leoweleoweScore: 95,930Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2026 19:5495,928824,749,688731,183,00065,016,0002,265,088
2Apr 2, 2026 19:5495,930827,019,976733,206,00063,017,0002,281,472
3Apr 2, 2026 19:5495,960825,171,096730,514,00065,956,0002,289,664