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 02:58Victor MerckléVictor MerckléScore: 3,802Success
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 02:593,75439,600,69230,037,0001,122,0002,117,632stderr
2Aug 12, 2026 02:593,75639,586,23130,049,0001,126,0002,117,632stderr
3Aug 12, 2026 02:593,75939,363,11930,061,0001,140,0002,117,632stderr
4Aug 12, 2026 02:593,80039,958,45230,384,0001,158,0002,117,632stderr
5Aug 12, 2026 02:593,80239,979,31930,499,0001,063,0002,117,632stderr
6Aug 12, 2026 02:593,81239,827,72930,557,0001,090,0002,117,632stderr
7Aug 12, 2026 02:593,82840,155,49430,471,0001,306,0002,117,632stderr
8Aug 12, 2026 02:593,85240,194,71130,826,0001,146,0002,117,632stderr
9Aug 12, 2026 02:594,00443,358,12032,170,0001,068,0002,117,632stderr