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 listAug 30, 2026 21:08Josu San MartinJosu San MartinScore: 4,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 21:094,51145,938,01036,416,0001,031,0002,113,536
2Aug 30, 2026 21:094,51345,895,98136,428,0001,031,0002,113,536
3Aug 30, 2026 21:094,52046,021,23936,495,0001,029,0002,113,536
4Aug 30, 2026 21:094,52145,967,91336,486,0001,040,0002,113,536
5Aug 30, 2026 21:094,52446,049,38236,509,0001,041,0002,113,536
6Aug 30, 2026 21:094,52447,562,85236,451,0001,101,0002,113,536
7Aug 30, 2026 21:094,52546,040,92636,527,0001,038,0002,113,536
8Aug 30, 2026 21:094,53446,087,73536,603,0001,032,0002,113,536
9Aug 30, 2026 21:094,53946,148,87636,647,0001,030,0002,113,536