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 4, 2025 05:48thatmagicalcatthatmagicalcatScore: 62,758Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2025 05:4862,725547,277,676519,621,000999,0002,367,488
2Jun 4, 2025 05:4862,748542,468,410518,807,0001,999,0002,281,472
3Jun 4, 2025 05:4862,751547,677,054518,838,0001,999,0002,363,392
4Jun 4, 2025 05:4862,755543,881,211518,871,0001,999,0002,363,392
5Jun 4, 2025 05:4862,758549,790,447519,894,000999,0002,285,568
6Jun 4, 2025 05:4862,763545,885,493519,931,000999,0002,355,200
7Jun 4, 2025 05:4862,779546,721,635519,066,0002,000,0002,285,568
8Jun 4, 2025 05:4862,810550,855,130521,327,00002,351,104
9Jun 4, 2025 05:4862,840553,734,731520,572,000999,0002,285,568