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 3, 2026 11:45Andrew EpsteinAndrew EpsteinScore: 61,940Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 11:4661,778521,976,195510,747,0002,014,0002,121,728stderr
2Nov 3, 2026 11:4661,818522,374,418511,081,0002,014,0002,121,728stderr
3Nov 3, 2026 11:4661,826522,945,004511,147,0002,015,0002,121,728stderr
4Nov 3, 2026 11:4661,867523,315,118511,491,0002,007,0002,121,728stderr
5Nov 3, 2026 11:4661,940523,875,756512,098,0002,010,0002,121,728stderr
6Nov 3, 2026 11:4661,957523,520,878512,213,0002,031,0002,121,728stderr
7Nov 3, 2026 11:4661,968523,670,787512,328,0002,009,0002,121,728stderr
8Nov 3, 2026 11:4661,983523,769,978512,458,0002,008,0002,121,728stderr
9Nov 3, 2026 11:4661,994524,337,674512,544,0002,014,0002,121,728stderr