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 listSep 6, 2026 03:04CheckHarryCheckHarryScore: 3,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 03:053,84241,752,77030,875,0001,017,0002,113,536
2Sep 6, 2026 03:053,85741,919,32230,952,0001,062,0002,113,536
3Sep 6, 2026 03:053,85941,900,28931,029,0001,008,0002,113,536
4Sep 6, 2026 03:053,86041,897,53231,033,0001,009,0002,113,536
5Sep 6, 2026 03:053,86041,891,43731,031,0001,009,0002,113,536
6Sep 6, 2026 03:053,86141,951,28331,031,0001,017,0002,113,536
7Sep 6, 2026 03:053,86750,946,38631,059,0001,038,0002,117,632
8Sep 6, 2026 03:053,92242,457,30931,542,0001,012,0002,113,536
9Sep 6, 2026 03:053,92952,387,50631,483,0001,129,0002,113,536