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 04:28thatmagicalcatthatmagicalcatScore: 95,691Success
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 04:2895,225820,398,248789,367,000999,0002,289,664
2Jun 4, 2025 04:2895,251817,511,982788,588,0001,998,0002,367,488
3Jun 4, 2025 04:2895,357817,877,085789,467,0001,998,0002,355,200
4Jun 4, 2025 04:2895,373814,722,697789,600,0001,998,0002,355,200
5Jun 4, 2025 04:2895,691818,562,577794,232,00002,363,392
6Jun 4, 2025 04:2895,735819,669,804792,604,0001,999,0002,285,568
7Jun 4, 2025 04:2895,742818,890,558793,659,000999,0002,281,472
8Jun 4, 2025 04:2895,837821,622,205793,449,0001,998,0002,285,568
9Jun 4, 2025 04:2896,616824,970,341799,911,0001,999,0002,363,392