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:37RacRacScore: 35,616Success
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:3735,601330,303,847294,488,0001,001,0002,269,184
2Nov 23, 2025 06:3735,601322,607,923293,488,0002,003,0002,260,992
3Nov 23, 2025 06:3735,611324,399,399294,572,0001,001,0002,269,184
4Nov 23, 2025 06:3735,613322,935,470293,595,0001,997,0002,269,184
5Nov 23, 2025 06:3735,616324,111,941294,618,000998,0002,494,464
6Nov 23, 2025 06:3735,620323,755,064293,653,0001,997,0002,269,184
7Nov 23, 2025 06:3735,624323,280,619293,682,0001,997,0002,269,184
8Nov 23, 2025 06:3735,628324,387,523293,717,0001,998,0002,269,184
9Nov 23, 2025 06:3735,629322,857,081293,725,0001,998,0002,404,352