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 20, 2025 17:58Adam FolwarcznyAdam FolwarcznyScore: 31,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2025 17:5831,209281,144,227257,034,0002,000,0002,433,024
2Aug 20, 2025 17:5831,380289,181,035259,455,0001,001,0002,531,328
3Aug 20, 2025 17:5831,390286,680,398259,537,0001,002,0002,441,216
4Aug 20, 2025 17:5831,407288,973,466258,676,0002,005,0002,428,928
5Aug 20, 2025 17:5831,411287,554,697259,715,000998,0002,531,328
6Aug 20, 2025 17:5831,675285,204,392260,907,0001,999,0002,441,216
7Aug 20, 2025 17:5831,677285,023,896260,916,0001,999,0002,531,328
8Aug 20, 2025 17:5831,773289,387,892261,717,0001,997,0002,445,312
9Aug 20, 2025 17:5831,774291,390,432261,724,0001,997,0002,437,120