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 listFeb 22, 2026 14:03SneedSneedScore: 68,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2026 14:0368,401594,350,751542,741,00024,988,0002,318,336
2Feb 22, 2026 14:0368,492593,340,793493,554,00074,932,0002,310,144
3Feb 22, 2026 14:0368,777592,539,432490,872,00079,979,0002,310,144