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 31, 2025 15:30KeefeKeefeScore: 19,121Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2025 15:3019,098188,144,583156,506,0002,006,0002,367,488
2May 31, 2025 15:3019,104188,729,034156,558,0002,007,0002,367,488
3May 31, 2025 15:3019,112186,669,432156,619,0002,007,0002,347,008
4May 31, 2025 15:3019,121193,620,890157,710,000998,0002,465,792
5May 31, 2025 15:3019,121187,005,054157,703,000998,0002,441,216
6May 31, 2025 15:3019,125184,009,827156,742,0001,996,0002,347,008
7May 31, 2025 15:3019,129182,156,660156,774,0001,997,0002,367,488
8May 31, 2025 15:3019,130182,761,570156,785,0001,997,0002,441,216
9May 31, 2025 15:3019,132183,845,440155,798,0002,996,0002,367,488