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 19:58Valentin KofmanValentin KofmanScore: 9,884Success
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 19:589,854107,257,41179,794,0001,994,0002,289,664
2Jun 23, 2025 19:589,854109,779,93879,797,0001,994,0002,289,664
3Jun 23, 2025 19:589,874105,480,16479,956,0001,998,0002,281,472
4Jun 23, 2025 19:589,884107,241,19580,035,0002,000,0002,289,664
5Jun 23, 2025 19:589,897106,528,83080,146,0002,003,0002,273,280
6Jun 23, 2025 19:589,905104,010,68180,205,0002,005,0002,367,488