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 12, 2026 05:20Victor MerckléVictor MerckléScore: 4,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 05:214,16442,969,64033,445,0001,118,0002,117,632stderr
2Aug 12, 2026 05:214,18743,152,35333,627,0001,131,0002,117,632stderr
3Aug 12, 2026 05:214,18843,136,86833,645,0001,118,0002,117,632stderr
4Aug 12, 2026 05:214,19043,214,57433,725,0001,060,0002,117,632stderr
5Aug 12, 2026 05:214,20243,447,70433,673,0001,207,0002,117,632stderr
6Aug 12, 2026 05:214,21743,450,27533,920,0001,088,0002,117,632stderr
7Aug 12, 2026 05:214,22743,509,93233,964,0001,125,0002,117,632stderr
8Aug 12, 2026 05:214,34844,621,07734,998,0001,091,0002,117,632stderr
9Aug 12, 2026 05:214,47950,574,17936,025,0001,151,0002,117,632stderr