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 1, 2026 10:22Victor MerckléVictor MerckléScore: 4,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 10:224,66147,081,17337,593,0001,094,0002,117,632stderr
2Aug 1, 2026 10:224,66147,231,39537,600,0001,094,0002,117,632stderr
3Aug 1, 2026 10:224,67347,879,44237,674,0001,112,0002,117,632stderr
4Aug 1, 2026 10:224,68047,241,50437,741,0001,103,0002,117,632stderr
5Aug 1, 2026 10:224,68047,274,47637,759,0001,086,0002,117,632stderr
6Aug 1, 2026 10:224,69148,129,59137,843,0001,095,0002,117,632stderr
7Aug 1, 2026 10:224,70147,392,28237,972,0001,049,0002,117,632stderr
8Aug 1, 2026 10:224,71447,533,53138,040,0001,092,0002,117,632stderr
9Aug 1, 2026 10:224,76448,623,82138,435,0001,111,0002,117,632stderr