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 22, 2025 21:36Adam FolwarcznyAdam FolwarcznyScore: 17,079Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 22, 2025 21:3517,063169,030,071140,622,0001,004,0002,441,216
2Aug 22, 2025 21:3517,078165,444,942139,751,0001,996,0002,437,120
3Aug 22, 2025 21:3517,078169,421,866139,755,0001,996,0002,531,328
4Aug 22, 2025 21:3617,078167,739,844139,749,0001,996,0002,437,120
5Aug 22, 2025 21:3517,079168,435,218140,761,000998,0002,531,328
6Aug 22, 2025 21:3517,079169,904,589139,757,0001,996,0002,433,024
7Aug 22, 2025 21:3517,079171,786,916139,760,0001,996,0002,449,408
8Aug 22, 2025 21:3517,080166,703,467139,768,0001,996,0002,449,408
9Aug 22, 2025 21:3517,080166,907,116140,763,000998,0002,433,024
10Aug 22, 2025 21:3617,080169,335,976139,769,0001,996,0002,445,312
11Aug 22, 2025 21:3617,080167,542,925139,769,0001,996,0002,445,312
12Aug 22, 2025 21:3517,081167,324,040140,772,000998,0002,531,328