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 listJun 10, 2026 11:56Victor MerckléVictor MerckléScore: 6,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 11:576,79764,100,69654,311,0002,109,0002,125,824stderr
2Jun 10, 2026 11:576,81464,030,26754,611,0001,947,0002,125,824stderr
3Jun 10, 2026 11:576,81764,248,59154,551,0002,038,0002,125,824stderr
4Jun 10, 2026 11:576,81965,486,09454,633,0001,972,0002,125,824stderr
5Jun 10, 2026 11:576,83064,207,37654,740,0001,955,0002,125,824stderr
6Jun 10, 2026 11:576,83964,521,93754,726,0002,038,0002,125,824stderr
7Jun 10, 2026 11:576,84364,427,80554,741,0002,060,0002,125,824stderr
8Jun 10, 2026 11:576,85664,601,56754,868,0002,038,0002,125,824stderr
9Jun 10, 2026 11:576,95565,253,19155,785,0001,942,0002,125,824stderr