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 listJan 22, 2026 09:36lipapipalipapipaScore: 40,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 09:3640,874363,040,720336,256,0003,002,0002,269,184
2Jan 22, 2026 09:3640,874362,821,952338,256,0001,000,0002,269,184
3Jan 22, 2026 09:3640,917368,499,308337,617,0001,997,0002,269,184
4Jan 22, 2026 09:3640,942366,133,546338,816,000999,0002,400,256
5Jan 22, 2026 09:3640,970364,179,835338,053,0002,000,0002,269,184
6Jan 22, 2026 09:3640,975365,120,021338,091,0002,000,0002,269,184
7Jan 22, 2026 09:3640,993360,809,917339,246,0001,000,0002,412,544
8Jan 22, 2026 09:3641,040369,629,453336,639,0003,995,0002,269,184
9Jan 22, 2026 09:3641,044371,041,408339,664,000999,0002,269,184