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 3, 2026 04:05Josu San MartinJosu San MartinScore: 6,127Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2026 04:055,84874,619,90447,524,0001,011,0002,441,216
2Jan 3, 2026 04:055,90074,698,08046,970,0001,998,0002,285,568
3Jan 3, 2026 04:056,12074,776,33848,806,0001,992,0002,445,312
4Jan 3, 2026 04:056,12780,508,61648,860,0001,994,0002,441,216
5Jan 3, 2026 04:056,13674,018,92948,934,0001,997,0002,445,312
6Jan 3, 2026 04:056,27474,590,26251,075,0001,001,0002,441,216