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 22, 2025 16:29Valentin KofmanValentin KofmanScore: 23,947Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 16:2923,944223,633,151196,737,0001,997,0002,269,184
2Jun 22, 2025 16:2923,946232,077,999196,756,0001,997,0002,269,184
3Jun 22, 2025 16:2923,946222,640,578198,754,00002,269,184
4Jun 22, 2025 16:2923,946230,474,701198,754,00002,289,664
5Jun 22, 2025 16:2923,947233,433,427196,759,0001,997,0002,273,280
6Jun 22, 2025 16:2923,947226,710,361196,766,0001,997,0002,269,184
7Jun 22, 2025 16:2923,978224,647,787197,015,0002,000,0002,289,664
8Jun 22, 2025 16:2923,980224,839,333197,037,0002,000,0002,273,280
9Jun 22, 2025 16:2923,994220,885,007196,152,0003,002,0002,269,184