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 2, 2025 16:36Jack FrigaardJack FrigaardScore: 4,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2025 16:364,64462,061,16636,521,0002,028,0002,519,040
2Aug 2, 2025 16:364,64759,903,01136,538,0002,029,0002,445,312
3Aug 2, 2025 16:364,65265,321,23736,581,0002,032,0002,293,760
4Aug 2, 2025 16:364,65263,463,82336,581,0002,032,0002,519,040
5Aug 2, 2025 16:364,65370,852,93136,587,0002,032,0002,519,040
6Aug 2, 2025 16:364,65667,393,01436,613,0002,034,0002,453,504
7Aug 2, 2025 16:364,66072,468,27436,640,0002,035,0002,437,120
8Aug 2, 2025 16:364,67662,094,60536,821,0001,990,0002,441,216
9Aug 2, 2025 16:364,71068,497,68436,084,0003,007,0002,437,120
10Aug 2, 2025 16:364,72869,188,22237,231,0002,012,0002,441,216
11Aug 2, 2025 16:364,73763,014,36936,295,0003,024,0002,519,040
12Aug 2, 2025 16:364,75161,903,85837,409,0002,022,0002,519,040