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 29, 2025 08:02Adam FolwarcznyAdam FolwarcznyScore: 10,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2025 08:0210,477112,222,58451,785,00035,175,0002,445,312
2Aug 29, 2025 08:0210,643117,760,11349,076,00039,261,0002,433,024
3Aug 29, 2025 08:0210,732112,156,02650,476,00038,599,0002,433,024
4Aug 29, 2025 08:0210,763119,677,22049,083,00040,248,0002,433,024
5Aug 29, 2025 08:0210,774113,594,57651,099,00038,324,0002,416,640
6Aug 29, 2025 08:0210,774116,866,79947,693,00041,731,0002,490,368