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 17, 2026 12:06shartgepettoshartgepettoScore: 7,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 12:067,22382,934,22555,957,0003,996,0002,392,064
2Mar 17, 2026 12:067,25481,191,34057,201,0003,010,0002,379,776
3Mar 17, 2026 12:067,26887,062,50456,301,0004,021,0002,408,448
4Mar 17, 2026 12:067,29281,418,19157,501,0003,026,0002,338,816
5Mar 17, 2026 12:067,31791,223,05956,753,0003,982,0002,465,792
6Mar 17, 2026 12:067,38186,737,73155,239,0006,026,0002,486,272
7Mar 17, 2026 12:067,39484,081,00057,344,0004,024,0002,506,752
8Mar 17, 2026 12:067,41087,416,22758,478,0003,024,0002,396,160
9Mar 17, 2026 12:067,52885,277,78560,466,0002,015,0002,404,352