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 1, 2026 09:48limanjun99limanjun99Score: 7,617Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 09:497,60183,893,76760,091,0003,004,0002,342,912
2May 1, 2026 09:497,60781,012,45060,139,0003,006,0002,498,560
3May 1, 2026 09:497,60881,691,71760,142,0003,007,0002,347,008
4May 1, 2026 09:497,61581,966,84760,199,0003,009,0002,314,240
5May 1, 2026 09:497,61780,847,73660,212,0003,010,0002,514,944
6May 1, 2026 09:497,62983,862,08061,311,0002,010,0002,519,040
7May 1, 2026 09:497,63784,343,89160,420,0002,971,0002,506,752
8May 1, 2026 09:497,72382,530,68262,105,0002,003,0002,502,656
9May 1, 2026 09:497,72779,447,02861,129,0003,006,0002,342,912