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 listMar 1, 2026 07:41Benji WhiteBenji WhiteScore: 67,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 1, 2026 07:4167,465581,504,990498,961,00060,995,0002,265,088
2Mar 1, 2026 07:4167,490586,823,603502,148,00058,017,0002,408,448
3Mar 1, 2026 07:4167,542584,969,809498,640,00061,955,0002,293,760
4Mar 1, 2026 07:4167,548582,981,299499,689,00060,962,0002,289,664
5Mar 1, 2026 07:4167,559583,068,240498,769,00061,971,0002,367,488
6Mar 1, 2026 07:4167,635590,132,697499,441,00061,930,0002,277,376
7Mar 1, 2026 07:4167,738588,561,572499,310,00062,913,0002,277,376
8Mar 1, 2026 07:4167,740589,675,966500,213,00062,026,0002,473,984
9Mar 1, 2026 07:4167,896586,612,927501,586,00061,948,0002,367,488