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 listApr 27, 2026 10:15wnwnScore: 3,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 10:163,39845,768,87527,203,0001,007,0002,482,176
2Apr 27, 2026 10:163,45344,581,83027,637,0001,023,0002,486,272
3Apr 27, 2026 10:163,45548,483,59527,660,0001,024,0002,490,368
4Apr 27, 2026 10:163,46747,696,34726,793,0001,984,0002,490,368
5Apr 27, 2026 10:163,51547,334,96729,176,00002,486,272
6Apr 27, 2026 10:163,54042,667,43429,383,00002,330,624
7Apr 27, 2026 10:163,55747,586,99929,525,00002,330,624
8Apr 27, 2026 10:163,61845,722,58928,033,0002,002,0002,482,176
9Apr 27, 2026 10:163,62849,485,01628,107,0002,007,0002,482,176