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 18, 2025 07:11Ashish AhujaAshish AhujaScore: 11,392Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 07:1111,148118,939,90887,556,0004,974,0002,527,232
2Aug 18, 2025 07:1111,351120,750,81087,199,0007,016,0002,281,472
3Aug 18, 2025 07:1111,364118,556,67488,302,0006,020,0002,269,184
4Aug 18, 2025 07:1111,392117,293,51487,585,0006,966,0002,531,328
5Aug 18, 2025 07:1111,734122,597,86792,426,0004,969,0002,277,376
6Aug 18, 2025 07:1111,950124,948,39993,170,0006,011,0002,342,912