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 listNov 23, 2025 06:31RacRacScore: 56,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2025 06:3156,580499,298,410406,664,00062,948,0002,506,752
2Nov 23, 2025 06:3156,619498,181,283411,947,00057,992,0002,506,752
3Nov 23, 2025 06:3156,753493,475,927411,041,00060,006,0002,506,752
4Nov 23, 2025 06:3156,754494,166,570410,053,00061,007,0002,289,664
5Nov 23, 2025 06:3156,772494,943,453410,181,00061,027,0002,506,752
6Nov 23, 2025 06:3156,851493,229,777415,880,00055,983,0002,502,656
7Nov 23, 2025 06:3156,858494,903,450411,930,00059,989,0002,502,656
8Nov 23, 2025 06:3156,879496,923,028419,084,00053,010,0002,506,752
9Nov 23, 2025 06:3156,901496,411,363421,250,00051,030,0002,289,664