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 20, 2026 13:38Yuriy LyfenkoYuriy LyfenkoScore: 4,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 13:384,59661,293,26435,141,0003,012,0002,260,992
2Apr 20, 2026 13:384,60562,623,08735,207,0003,017,0002,265,088
3Apr 20, 2026 13:384,61162,780,04235,251,0003,021,0002,273,280