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 27, 2026 00:53Victor MerckléVictor MerckléScore: 4,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 00:544,09642,382,35032,851,0001,149,0002,117,632stderr
2Aug 27, 2026 00:544,13042,685,20233,191,0001,093,0002,117,632stderr
3Aug 27, 2026 00:544,13142,644,43233,196,0001,093,0002,117,632stderr
4Aug 27, 2026 00:544,13442,652,19133,245,0001,072,0002,117,632stderr
5Aug 27, 2026 00:544,14042,721,34433,229,0001,136,0002,117,632stderr
6Aug 27, 2026 00:544,15142,892,50333,385,0001,075,0002,117,632stderr
7Aug 27, 2026 00:544,19743,699,73733,759,0001,077,0002,117,632stderr
8Aug 27, 2026 00:544,31144,765,05834,711,0001,078,0002,117,632stderr
9Aug 27, 2026 00:544,33544,363,84934,913,0001,069,0002,117,632stderr