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 listOct 24, 2026 04:04Nao MinamiNao MinamiScore: 32,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 04:0532,286279,455,192266,973,0001,004,0002,113,536
2Oct 24, 2026 04:0532,289278,871,163266,996,0001,005,0002,113,536
3Oct 24, 2026 04:0532,291280,333,267267,015,0001,005,0002,113,536
4Oct 24, 2026 04:0532,297279,668,515266,033,0002,035,0002,113,536
5Oct 24, 2026 04:0532,298279,220,300267,078,0001,003,0002,113,536
6Oct 24, 2026 04:0532,301282,495,511266,025,0002,076,0002,113,536
7Oct 24, 2026 04:0532,301279,523,954267,098,0001,003,0002,113,536
8Oct 24, 2026 04:0532,304279,581,188266,117,0002,012,0002,113,536
9Oct 24, 2026 04:0532,315279,177,250266,095,0002,120,0002,113,536