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 listJun 23, 2025 21:52Valentin KofmanValentin KofmanScore: 9,060Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 21:526,62577,916,01352,986,0001,999,0002,359,296
2Jun 23, 2025 21:526,63077,266,17153,028,0002,001,0002,273,280
3Jun 23, 2025 21:526,63781,998,46454,082,0001,001,0002,277,376
4Jun 23, 2025 21:529,06099,872,70474,199,0001,002,0002,289,664
5Jun 23, 2025 21:529,06796,337,18774,251,0001,003,0002,269,184
6Jun 23, 2025 21:529,140109,010,07074,860,000998,0002,273,280