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 25, 2025 19:31Adam FolwarcznyAdam FolwarcznyScore: 12,592Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 19:3112,579130,463,665102,400,0002,007,0002,433,024
2Aug 25, 2025 19:3112,580127,854,332103,408,0001,003,0002,400,256
3Aug 25, 2025 19:3112,583132,169,850101,426,0003,012,0002,437,120
4Aug 25, 2025 19:3112,591134,633,417102,493,0002,009,0002,400,256
5Aug 25, 2025 19:3112,592132,185,159101,499,0003,014,0002,400,256
6Aug 25, 2025 19:3112,593134,891,757102,516,0002,010,0002,441,216
7Aug 25, 2025 19:3112,596127,828,427102,534,0002,010,0002,523,136
8Aug 25, 2025 19:3112,604127,319,951100,626,0003,985,0002,400,256
9Aug 25, 2025 19:3112,617129,595,035102,729,0001,994,0002,449,408