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 10, 2026 08:56poyo180605poyo180605Score: 45,982Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 10, 2026 08:5645,928409,100,079322,173,00059,031,0002,269,184
2Apr 10, 2026 08:5645,952406,784,494324,492,00056,910,0002,367,488
3Apr 10, 2026 08:5645,977404,019,921317,677,00063,935,0002,289,664
4Apr 10, 2026 08:5645,981407,331,909321,697,00059,943,0002,269,184
5Apr 10, 2026 08:5645,982411,861,340322,707,00058,946,0002,519,040
6Apr 10, 2026 08:5645,991407,824,978319,772,00061,955,0002,510,848
7Apr 10, 2026 08:5646,002405,842,890319,849,00061,970,0002,289,664
8Apr 10, 2026 08:5646,015408,970,666321,938,00059,988,0002,269,184
9Apr 10, 2026 08:5646,015405,041,414319,938,00061,988,0002,359,296