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:20Victor MerckléVictor MerckléScore: 7,255Success
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:207,24868,566,86759,073,0001,092,0002,117,632stderr
2Aug 11, 2026 00:207,24968,480,33859,070,0001,098,0002,117,632stderr
3Aug 11, 2026 00:207,24968,533,27659,076,0001,092,0002,117,632stderr
4Aug 11, 2026 00:207,25068,595,64759,086,0001,090,0002,117,632stderr
5Aug 11, 2026 00:207,25569,222,69159,119,0001,098,0002,117,632stderr
6Aug 11, 2026 00:207,25668,545,84059,141,0001,092,0002,117,632stderr
7Aug 11, 2026 00:207,26468,597,22559,184,0001,115,0002,117,632stderr
8Aug 11, 2026 00:207,26869,932,14159,248,0001,083,0002,117,632stderr
9Aug 11, 2026 00:207,29269,616,74259,415,0001,109,0002,117,632stderr