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 listMar 2, 2026 11:55Priyansh RathiPriyansh RathiScore: 42,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 11:5542,685382,979,387351,283,0003,002,0002,363,392
2Mar 2, 2026 11:5542,941385,059,569354,418,0001,996,0002,547,712
3Mar 2, 2026 11:5542,972384,236,585353,667,0002,997,0002,371,584
4Mar 2, 2026 11:5542,990386,272,562354,821,0001,998,0002,527,232
5Mar 2, 2026 11:5542,992385,979,574354,836,0001,999,0002,355,200
6Mar 2, 2026 11:5543,000389,114,137355,903,000999,0002,359,296
7Mar 2, 2026 11:5543,002387,826,851353,919,0002,999,0002,371,584
8Mar 2, 2026 11:5543,015387,341,573355,024,0002,000,0002,531,328
9Mar 2, 2026 11:5543,037385,058,848355,209,0002,001,0002,351,104