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 listSep 6, 2025 20:25Adam FolwarcznyAdam FolwarcznyScore: 7,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2025 20:257,32689,085,27946,849,00013,955,0002,326,528
2Sep 6, 2025 20:257,36284,757,47149,085,00012,020,0002,281,472
3Sep 6, 2025 20:257,38684,814,22951,253,00010,049,0002,400,256
4Sep 6, 2025 20:257,38681,923,24347,237,00014,070,0002,310,144
5Sep 6, 2025 20:257,48884,860,80751,124,00011,026,0002,269,184
6Sep 6, 2025 20:257,52089,342,82049,328,00013,087,0002,281,472