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 listNov 3, 2026 13:23Andrew EpsteinAndrew EpsteinScore: 178,746Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 13:24177,8641,486,171,3211,471,771,0004,506,0002,125,824stderr
2Nov 3, 2026 13:24178,3881,490,164,1081,474,377,0006,245,0002,125,824stderr
3Nov 3, 2026 13:24178,4081,490,586,8011,476,447,0004,344,00032,768stderr
4Nov 3, 2026 13:24178,7091,492,811,7781,475,875,0007,416,0002,121,728stderr
5Nov 3, 2026 13:24178,7461,493,024,7991,477,765,0005,834,0002,125,824stderr
6Nov 3, 2026 13:24178,9731,495,274,2821,477,062,0008,421,0002,121,728stderr
7Nov 3, 2026 13:24179,1901,496,873,6411,480,858,0006,421,0002,121,728stderr
8Nov 3, 2026 13:24179,4181,498,925,9521,481,274,0007,901,0002,125,824stderr
9Nov 3, 2026 13:24179,6081,502,773,2461,485,979,0004,771,0002,121,728stderr