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 listJul 30, 2026 14:32CodeReclaimersCodeReclaimersScore: 69,486Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 14:3269,469586,750,014517,058,00059,537,0002,113,536
2Jul 30, 2026 14:3269,476586,725,856517,000,00059,654,0002,113,536
3Jul 30, 2026 14:3269,480586,751,923517,026,00059,661,0002,113,536
4Jul 30, 2026 14:3269,480587,482,690517,058,00059,627,0002,113,536
5Jul 30, 2026 14:3269,486587,580,084517,097,00059,638,0002,113,536
6Jul 30, 2026 14:3269,530587,902,623517,136,00059,965,0002,113,536
7Jul 30, 2026 14:3269,535587,178,479517,054,00060,092,0002,113,536
8Jul 30, 2026 14:3269,549588,075,094517,060,00060,200,0002,113,536
9Jul 30, 2026 14:3269,616587,852,146517,486,00060,327,0002,113,536