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 29, 2025 02:08CCScore: 146,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2025 02:08146,1071,239,355,7501,210,693,0001,999,0002,285,568
2Jun 29, 2025 02:08146,4171,242,617,9821,213,264,0001,998,0002,371,584
3Jun 29, 2025 02:08146,4371,238,915,1761,213,427,0001,999,0002,273,280
4Jun 29, 2025 02:08146,5001,248,619,3391,215,949,00002,285,568
5Jun 29, 2025 02:08146,5041,245,032,9131,214,982,000999,0002,265,088
6Jun 29, 2025 02:08146,5541,244,077,0911,215,401,000999,0002,277,376
7Jun 29, 2025 02:08146,5601,242,621,3581,214,451,0001,999,0002,265,088
8Jun 29, 2025 02:08146,6111,246,943,0541,215,876,000999,0002,379,776
9Jun 29, 2025 02:08160,5661,357,954,7951,331,699,000999,0002,269,184