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 26, 2026 23:12Victor MerckléVictor MerckléScore: 3,879Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 23:123,79539,634,13730,373,0001,133,0002,117,632stderr
2Aug 26, 2026 23:123,80039,829,16630,406,0001,142,0002,117,632stderr
3Aug 26, 2026 23:123,84040,136,24730,735,0001,140,0002,117,632stderr
4Aug 26, 2026 23:123,85840,244,08630,910,0001,115,0002,117,632stderr
5Aug 26, 2026 23:123,87941,227,00031,055,0001,141,0002,117,632stderr
6Aug 26, 2026 23:123,91440,826,10631,340,0001,151,0002,117,632stderr
7Aug 26, 2026 23:123,98741,258,56731,951,0001,144,0002,117,632stderr
8Aug 26, 2026 23:124,03641,741,41032,452,0001,054,0002,117,632stderr
9Aug 26, 2026 23:124,13043,318,22633,148,0001,133,0002,117,632stderr