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 26, 2026 21:47Victor MerckléVictor MerckléScore: 4,021Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 21:473,96341,994,21231,759,0001,139,0002,117,632stderr
2Aug 26, 2026 21:473,99941,567,27132,017,0001,180,0002,117,632stderr
3Aug 26, 2026 21:474,00342,883,67932,095,0001,131,0002,117,632stderr
4Aug 26, 2026 21:474,01341,719,60732,188,0001,122,0002,117,632stderr
5Aug 26, 2026 21:474,02141,799,33432,287,0001,091,0002,117,632stderr
6Aug 26, 2026 21:474,05042,649,39532,473,0001,146,0002,117,632stderr
7Aug 26, 2026 21:474,05242,901,26032,507,0001,129,0002,117,632stderr
8Aug 26, 2026 21:474,10642,498,61132,965,0001,123,0002,117,632stderr
9Aug 26, 2026 21:474,36944,621,50435,212,0001,058,0002,117,632stderr