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 listMar 14, 2026 22:36Ondřej PolaneckýOndřej PolaneckýScore: 23,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 22:3623,258217,755,134190,042,0003,000,0002,277,376
2Mar 14, 2026 22:3623,264220,719,306191,092,0002,000,0002,519,040
3Mar 14, 2026 22:3623,267223,190,486191,114,0002,001,0002,269,184
4Mar 14, 2026 22:3623,598221,276,878193,868,0001,998,0002,265,088
5Mar 14, 2026 22:3623,601217,986,142193,891,0001,998,0002,277,376
6Mar 14, 2026 22:3623,620222,454,146193,050,0003,000,0002,273,280
7Mar 14, 2026 22:3623,623218,694,200192,074,0004,001,0002,277,376
8Mar 14, 2026 22:3623,625220,327,080194,087,0002,000,0002,269,184
9Mar 14, 2026 22:3623,686223,285,571194,596,0001,995,0002,277,376