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 22:18Victor MerckléVictor MerckléScore: 3,966Success
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 22:193,91742,302,39631,488,0001,030,0002,117,632stderr
2Aug 11, 2026 22:193,93041,017,69531,593,0001,031,0002,117,632stderr
3Aug 11, 2026 22:193,93341,131,85431,545,0001,100,0002,117,632stderr
4Aug 11, 2026 22:193,95141,205,84231,774,0001,026,0002,117,632stderr
5Aug 11, 2026 22:193,96641,333,83131,891,0001,030,0002,117,632stderr
6Aug 11, 2026 22:193,96941,357,87931,723,0001,227,0002,117,632stderr
7Aug 11, 2026 22:193,97541,373,67831,967,0001,031,0002,117,632stderr
8Aug 11, 2026 22:193,97941,260,43931,825,0001,207,0002,117,632stderr
9Aug 11, 2026 22:194,06042,187,17632,583,0001,122,0002,117,632stderr