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:32RacRacScore: 40,820Success
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:3240,806365,991,120337,687,000999,0002,277,376
2Nov 23, 2025 06:3240,806371,128,788336,692,0001,998,0002,277,376
3Nov 23, 2025 06:3240,806367,298,255336,692,0001,998,0002,269,184
4Nov 23, 2025 06:3240,808364,018,201336,706,0001,998,0002,510,848
5Nov 23, 2025 06:3240,820361,800,406334,810,0003,997,0002,260,992
6Nov 23, 2025 06:3240,824368,360,954336,837,0001,999,0002,277,376
7Nov 23, 2025 06:3240,827362,058,029335,864,0002,998,0002,277,376
8Nov 23, 2025 06:3240,835364,527,872335,929,0002,999,0002,437,120
9Nov 23, 2025 06:3240,843363,791,753335,001,0004,000,0002,269,184