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 listMar 12, 2026 15:21Josu San MartinJosu San MartinScore: 5,196Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 15:214,91967,131,96638,837,0001,991,0002,433,024
2Mar 12, 2026 15:214,93262,843,80838,941,0001,997,0002,281,472
3Mar 12, 2026 15:214,94466,001,13239,032,0002,001,0002,281,472
4Mar 12, 2026 15:214,95067,157,95539,082,0002,004,0002,277,376
5Mar 12, 2026 15:215,05563,975,19839,959,0001,997,0002,420,736
6Mar 12, 2026 15:215,16667,601,73640,884,0001,994,0002,433,024
7Mar 12, 2026 15:215,19660,925,36341,119,0002,005,0002,277,376
8Mar 12, 2026 15:215,19766,624,24741,132,0002,006,0002,424,832
9Mar 12, 2026 15:215,23869,310,65942,466,0001,011,0002,433,024
10Mar 12, 2026 15:215,25967,145,86242,637,0001,015,0002,281,472
11Mar 12, 2026 15:215,27967,184,26442,819,000995,0002,519,040
12Mar 12, 2026 15:215,28665,829,47841,883,0001,994,0002,416,640