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 listMay 6, 2026 02:07olliecrowolliecrowScore: 6,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2026 02:076,75570,702,87854,008,0002,065,0002,375,680
2May 6, 2026 02:076,81676,781,38554,454,0002,123,0002,314,240
3May 6, 2026 02:076,86074,959,06854,882,0002,058,0002,547,712
4May 6, 2026 02:076,92374,661,02755,320,0002,144,0002,347,008
5May 6, 2026 02:076,97475,385,46655,785,0002,105,0002,318,336
6May 6, 2026 02:076,98373,511,51755,843,0002,123,0002,408,448
7May 6, 2026 02:076,98770,198,39755,809,0002,191,0002,514,944
8May 6, 2026 02:077,02574,194,38256,194,0002,119,0002,314,240
9May 6, 2026 02:077,07574,654,50556,487,0002,241,0002,486,272