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 11, 2026 00:59Victor MerckléVictor MerckléScore: 3,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 01:003,86140,258,18930,935,0001,117,0002,117,632stderr
2Aug 11, 2026 01:003,86840,267,10930,994,0001,113,0002,117,632stderr
3Aug 11, 2026 01:003,86940,437,56630,983,0001,130,0002,117,632stderr
4Aug 11, 2026 01:003,87040,432,08730,916,0001,212,0002,117,632stderr
5Aug 11, 2026 01:003,87740,508,79431,017,0001,169,0002,117,632stderr
6Aug 11, 2026 01:003,88140,513,60431,102,0001,117,0002,117,632stderr
7Aug 11, 2026 01:003,88541,179,14631,059,0001,193,0002,117,632stderr
8Aug 11, 2026 01:003,94741,082,10131,567,0001,197,0002,117,632stderr
9Aug 11, 2026 01:003,99841,494,14032,076,0001,114,0002,117,632stderr