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 listAug 12, 2026 06:27Victor MerckléVictor MerckléScore: 4,264Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 06:284,19043,209,77233,670,0001,114,0002,117,632stderr
2Aug 12, 2026 06:284,21843,438,45433,961,0001,049,0002,117,632stderr
3Aug 12, 2026 06:284,25343,720,82434,249,0001,053,0002,117,632stderr
4Aug 12, 2026 06:284,25444,883,76134,202,0001,113,0002,117,632stderr
5Aug 12, 2026 06:284,26443,838,62234,317,0001,076,0002,117,632stderr
6Aug 12, 2026 06:284,26643,781,89434,317,0001,095,0002,117,632stderr
7Aug 12, 2026 06:284,26743,798,52534,360,0001,057,0002,117,632stderr
8Aug 12, 2026 06:284,49445,761,91336,167,0001,135,0002,117,632stderr
9Aug 12, 2026 06:284,51645,876,25836,419,0001,072,0002,117,632stderr