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 1, 2026 19:14Josu San MartinJosu San MartinScore: 9,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 19:149,14199,827,25672,873,0002,994,0002,433,024
2Jan 1, 2026 19:149,165100,316,79273,067,0003,002,0002,383,872
3Jan 1, 2026 19:149,18097,485,41275,190,0001,002,0002,363,392
4Jan 1, 2026 19:149,45399,129,36676,448,0002,011,0002,318,336
5Jan 1, 2026 19:149,488107,164,24875,764,0002,990,0002,318,336
6Jan 1, 2026 19:149,489109,221,06477,760,000996,0002,383,872
7Jan 1, 2026 19:149,489108,821,48174,772,0003,987,0002,510,848
8Jan 1, 2026 19:149,490104,613,64975,780,0002,991,0002,281,472
9Jan 1, 2026 19:149,495101,308,36875,813,0002,992,0002,453,504
10Jan 1, 2026 19:149,499102,360,70376,848,0001,996,0002,310,144
11Jan 1, 2026 19:149,512107,662,40574,952,0003,997,0002,510,848
12Jan 1, 2026 19:149,518103,634,11776,997,0001,999,0002,424,832