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:15Victor MerckléVictor MerckléScore: 3,918Success
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 00:163,89840,747,76531,278,0001,078,0002,117,632stderr
2Aug 11, 2026 00:163,90940,809,61231,385,0001,060,0002,117,632stderr
3Aug 11, 2026 00:163,91540,880,57831,338,0001,162,0002,117,632stderr
4Aug 11, 2026 00:163,91640,893,58731,413,0001,090,0002,117,632stderr
5Aug 11, 2026 00:163,91840,904,85231,446,0001,081,0002,117,632stderr
6Aug 11, 2026 00:163,92240,959,25131,400,0001,157,0002,117,632stderr
7Aug 11, 2026 00:163,93240,993,03031,538,0001,098,0002,117,632stderr
8Aug 11, 2026 00:163,93741,034,16231,593,0001,091,0002,117,632stderr
9Aug 11, 2026 00:163,95541,938,90031,677,0001,152,0002,117,632stderr