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 listFeb 7, 2026 18:18Benn TanBenn TanScore: 8,718Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 18:188,70096,003,30770,209,0002,005,0002,277,376
2Feb 7, 2026 18:188,712103,297,51072,311,00002,277,376
3Feb 7, 2026 18:188,71595,812,87971,329,0001,004,0002,396,160
4Feb 7, 2026 18:188,716107,163,20871,342,0001,004,0002,404,352
5Feb 7, 2026 18:188,71792,320,49972,347,00002,277,376
6Feb 7, 2026 18:188,71895,208,93072,360,00002,277,376
7Feb 7, 2026 18:188,71893,210,31672,360,00002,510,848
8Feb 7, 2026 18:188,72295,106,13471,385,0001,005,0002,277,376
9Feb 7, 2026 18:188,72495,244,53271,405,0001,005,0002,387,968
10Feb 7, 2026 18:1811,032119,702,94390,559,0001,006,0002,273,280
11Feb 7, 2026 18:1811,041122,434,55590,636,0001,007,0002,273,280
12Feb 7, 2026 18:1811,041123,842,93291,643,00002,273,280