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:42leoweleoweScore: 55,824Success
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:4255,787489,500,994461,033,0002,000,0002,371,584
2Apr 2, 2026 19:4255,824494,267,612461,338,0002,001,0002,473,984
3Apr 2, 2026 19:4255,854491,989,163459,593,0003,996,0002,347,008