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 listFeb 18, 2026 22:30Josu San MartinJosu San MartinScore: 6,342Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 22:305,91372,592,73046,071,0003,004,0002,322,432
2Feb 18, 2026 22:306,08876,490,40948,511,0002,021,0002,330,624
3Feb 18, 2026 22:306,14774,913,73650,023,0001,000,0002,314,240
4Feb 18, 2026 22:306,34283,735,17250,611,0002,024,0002,482,176
5Feb 18, 2026 22:306,36177,750,76551,802,000996,0002,514,944
6Feb 18, 2026 22:306,50981,752,82652,023,0002,000,0002,465,792